Cutting Markovian trees
نویسندگان
چکیده
منابع مشابه
Markovian simulation for ancestors trees
We present a computational model to reconstruct ancestor trees of animals with sexual reproduction following the theoretical model presented in Phys. Rev. E 90, 022125 (2014). Through a recursive algorithm combined with a random number generator, it is possible to reproduce the number of ancestor for each generation and use it to constraint a maximum number of the following generation. This sim...
متن کاملCutting Recursive Autoencoder Trees
Deep Learning models enjoy considerable success in Natural Language Processing. While deep architectures produce useful representations that lead to improvements in various tasks, they are often difficult to interpret. This makes the analysis of learned structures particularly difficult. In this paper, we rely on empirical tests to see whether a particular structure makes sense. We present an a...
متن کاملAsymptotic Cost of Cutting Down Random Free Trees
In this work, we calculate the limit distribution of the total cost incurred by splitting a tree selected at random from the set of all finite free trees. This total cost is considered to be an additive functional induced by a toll equal to the square of the size of tree. The main tools used are the recent results connecting the asymptotics of generating functions with the asymptotics of...
متن کاملLinking and Cutting Spanning Trees
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs we prove that this approach significantly outperforms existing algorithms. For general graphs we obtain no analytical bounds, but experimental results ...
متن کاملCutting down $\mathbf p$-trees and inhomogeneous continuum random trees
We study a fragmentation of the p-trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1–18, 2000]. We give exact correspondences between the p-trees and trees which encode the fragmentation. We then use these results to study the fragmentation of the ICRTs (scaling limits of p-trees) and give distributional correspondences between the ICRT and the tree encoding the fragmentation. The th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Academiae Scientiarum Fennicae Series A I Mathematica
سال: 1992
ISSN: 0066-1953
DOI: 10.5186/aasfm.1992.1716